Four Coloring for a Subset of Maximal Planar Graphs with Minimum Degree Five
نویسنده
چکیده
In this paper, we present some results on maximal planar graphs with minimum degree ve, denoted by MPG5 graphs [6]. We consider a subset of MPG5 graphs, called the Z graphs, for which all vertices of degree superior to ve are not adjacent. We give a vertex four coloring for every Z graph.
منابع مشابه
On Linear-Time Algorithms for Five-Coloring Planar Graphs
It is well known that the vertices of a planar graph can be colored with no more than four colors [l]. However, the rather detailed proof of this fact leads to a @(n*) algorithm for determining such a coloring. To yield faster algorithms, several authors have considered generating a fivecoloring rather than a four-coloring [4]. Recently, two different approaches to five-coloring planar graphs h...
متن کاملA Generalization of Kotzig's Theorem and Its Application
An edge of a graph is light when the sum of the degrees of its endvertices is at most 13. The well-known Kotzig Theorem states that every 3-connected planar graph contains a light edge. Later, Borodin [1] extended this result to the class of planar graphs of minimum degree at least 3. We deal with generalizations of these results for planar graphs of minimum degree 2. Borodin, Kostochka and Woo...
متن کاملOn the cost chromatic number of outerplanar, planar, and line graphs
We consider vertex colorings of graphs in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of the coloring is the sum of the costs incurred at each vertex. The cost chromatic number of a graph with respect to a cost set is the minimum number of colors necessary to produce a minimum cost coloring of the graph. We show that the cost c...
متن کاملEnumeration of Maximal Planar Graphs with minimum degree Five
In this paper, we give a process to enumerate all maximal planar graphs with minimum degree ve, with a xed number of vertices. These graphs are called MPG5 [6]. We have used the algorithm [3] to generate these graphs. For the MPG5 enumeration we have used the general method due to Brenda McKay in [5]; i.e. by computing the orbits set of automorphism group and canonical forms.
متن کاملGenerating Rooted Triangulations with Minimum Degree Four
A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists. In this article, we show that in the set of rooted triangulations on n points w...
متن کامل